EMBEDDINGS INTO OUTER MODELS

نویسندگان

چکیده

Abstract We explore the possibilities for elementary embeddings $j : M \to N$ , where and N are models of ZFC with same ordinals, $M \subseteq has access to large pieces j . construct commuting systems such maps between countable transitive that isomorphic various canonical linear partial orders, including real line ${\mathbb R}$

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Embeddings into

We give examples of proper normal surfaces that are not embeddable into simplicial toric prevarieties nor toric prevarieties of a ne intersection.

متن کامل

Embeddings into Crossed Cubes

The hypercube parallel architecture is one of the most popular interconnection networks due to many of its attractive properties and its suitability for general purpose parallel processing. An attractive version of the hypercube is the crossed cube. It preserves the important properties of the hypercube and most importantly reduces the diameter by a factor of two. In this paper, we show the abi...

متن کامل

Embeddings of Chains into Chains

Continuity of isotone mappings and embeddings of a chain G into another chain are studied. Especially, conditions are found under which the set of points of discontinuity of such a mapping is dense in G.

متن کامل

Geometric Quasi - Isometric Embeddings Into

We show that F has an infinite family of quasi-isometrically embedded subgroups of the form F m × Zn, for integral m, n ≥ 0. These subgroups have simple geometric but more complicated algebraic descriptions We present them to illustrate the intricate geometry of Thompson’s group F as well as the interplay between its standard finite and infinite presentations.

متن کامل

Multiple Network Embeddings into Hypercubes

In this paper we study the problem of how to efficiently embed r interconnection networks Go, ... ,Gr _ ll r :$ k, into a k-dimensional hypercube H so that every node of the hypercube is assigned at most T nodes all of which belong to different G;'s. When each G j is a complete binary tree or a leap tree of 2 -1 nodes, we describe an embedding achieving a dilation of 2 and a load of 5 and 6, re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Logic

سال: 2022

ISSN: ['1943-5886', '0022-4812']

DOI: https://doi.org/10.1017/jsl.2022.52